Fully constrained least squares linear spectral mixture analysis method for material quantification in hyperspectral imagery
نویسندگان
چکیده
Linear spectral mixture analysis (LSMA) is a widely used technique in remote sensing to estimate abundance fractions of materials present in an image pixel. In order for an LSMA-based estimator to produce accurate amounts of material abundance, it generally requires two constraints imposed on the linear mixture model used in LSMA, which are the abundance sum-to-one constraint and the abundance nonnegativity constraint. The first constraint requires the sum of the abundance fractions of materials present in an image pixel to be one and the second imposes a constraint that these abundance fractions be nonnegative. While the first constraint is easy to deal with, the second constraint is difficult to implement since it results in a set of inequalities and can only be solved by numerical methods. Consequently, most LSMA-based methods are unconstrained and produce solutions that do not necessarily reflect the true abundance fractions of materials. In this case, they can only be used for the purposes of material detection, discrimination, and classification, but not for material quantification. In this paper, we present a fully constrained least squares (FCLS) linear spectral mixture analysis method for material quantification. Since no closed form can be derived for this method, an efficient algorithm is developed to yield optimal solutions. In order to further apply the designed algorithm to unknown image scenes, an unsupervised least squares error (LSE)-based method is also proposed to extend the FCLS method in an unsupervised manner. A series of computer simulations and real hyperspectral data experiments were conducted to demonstrate the performance of the proposed FCLS LSMA approach in material quantification.
منابع مشابه
Key Information Retrieval in Hyperspectral Imagery through Spatial-Spectral Data Fusion
Hyperspectral (HS) imaging is measuring the radiance of materials within each pixel area at a large number of contiguous spectral wavelength bands. The key spatial information such as small targets and border lines are hard to be precisely detected from HS data due to the technological constraints. Therefore, the need for image processing techniques is an important field of research in HS remot...
متن کاملGeometric Abundance Estimation Using Variable Endmembers for Hyperspectral Imagery
Abundance estimation is an important step of quantitative analysis of hyperspectral remote sensing data. Due to physical interpretation, sum-to-one and non-negativity constraints are generally imposed on the abundances of materials. This paper presents a geometric approach to fully constrained linear spectral unmixing using variable endmember sets for the pixels. First, an improved method for s...
متن کاملA normalized scaled gradient method to solve non-negativity and equality constrained linear inverse problem – Application to spectral mixture analysis
This paper addresses the problem of minimizing a convex cost function under non-negativity and equality constraints, with the aim of solving the linear unmixing problem encountered in hyperspectral imagery. This problem can be formulated as a linear regression problem whose regression coefficients (abundances) satisfy sumto-one and positivity constraints. A normalized scaled gradient iterative ...
متن کاملTarget Detection Improvements in Hyperspectral Images by Adjusting Band Weights and Identifying end-members in Feature Space Clusters
Spectral target detection could be regarded as one of the strategic applications of hyperspectral data analysis. The presence of targets in an area smaller than a pixel’s ground coverage has led to the development of spectral un-mixing methods to detect these types of targets. Usually, in the spectral un-mixing algorithms, the similar weights have been assumed for spectral bands. Howe...
متن کاملPositive solution of non-square fully Fuzzy linear system of equation in general form using least square method
In this paper, we propose the least-squares method for computing the positive solution of a $mtimes n$ fully fuzzy linear system (FFLS) of equations, where $m > n$, based on Kaffman's arithmetic operations on fuzzy numbers that introduced in [18]. First, we consider all elements of coefficient matrix are non-negative or non-positive. Also, we obtain 1-cut of the fuzzy number vector solution of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEEE Trans. Geoscience and Remote Sensing
دوره 39 شماره
صفحات -
تاریخ انتشار 2001